#include"stack.h"
#include"queue.h"
#include"priority_queue.h"


int main()
{
	cls::priority_queue<int,vector<int>,Greater<int>> pq;
	pq.push(1);
	pq.push(6);
	pq.push(100);
	pq.push(10);
	while (!pq.empty())
	{
		cout << pq.top() << endl;
		pq.pop();
	}
	
	


	return 0;
}